#include<bits/stdc++.h>
using namespace std;
int const maxn=1e5+5;
priority_queue<int,vector<int>,greater<int> >q;
int a[maxn];
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)scanf("%d",a+i);
    sort(a+1,a+1+n);
    int ans=n;
    for(int i=1;i<=n;i++){
        if(q.size()&&q.top()<a[i])ans--,q.pop();
        q.push(a[i]);
    }
    printf("%d",ans);
}